Limit theory for the random on-line nearest-neighbor graph
نویسندگان
چکیده
منابع مشابه
Limit theory for the random on-line nearest-neighbor graph
In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic behaviour of the total power-weighted length of the ONG on uniform random points in (0, 1)d. In particular, for d = 1 and weight exponent α > 1/2, the limitin...
متن کاملAsymptotic theory for the multidimensional random on-line nearest-neighbour graph
The on-line nearest-neighbour graph on a sequence of n uniform random points in (0, 1)d (d ∈ N) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this graph, with weight exponent α ∈ (0, d/2], we prove O(max{n1−(2α/d), log n}) upper bounds on the variance. On the other hand, we give an n → ∞ large-sample convergence r...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملPercolation in the k-nearest neighbor graph
Let P be a Poisson process of intensity one in R2. For a fixed integer k, join every point of P to its k nearest neighbors, creating a directed random geometric graph ~ Gk(R). We prove bounds on the values of k that, almost surely, result in an infinite connected component in ~ Gk(R) for various definitions of “component”. We also give high confidence results for the exact values of k needed. I...
متن کاملFe b 20 07 Central limit theorem for the on - line nearest - neighbour graph
The on-line nearest-neighbour graph on a sequence of uniform random points in (0, 1)d (d ∈ N) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge length of this graph, with weight exponent α ∈ (0, d/2), we prove a central limit theorem (in the large-sample limit), including an expression for the limiting variance. In contrast, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2008
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20185